Search results for "Transfinite induction"

showing 2 items of 2 documents

Did Brouwer’s Intuitionistic Analysis Satisfy Its Own Epistemological Standards?

2000

The aim of this essay is both historical and philosophical. On the histori. level, the following remarks are intended to contribute to a better understanding of the missing reception of the more advanced parts of Luitzen E. J. Brouwer’s intuitionistic mathematics. More precisely, I want to draw attention to a crucial technical difficulty in Brouwer’s treatment of the basic theorems of intuitionistic analysis. It concerns the (intuitionistic) proof of what Brouwer viewed as one of the cornerstones of intuitionistic set theory, the “fan theorem,” as it is often called today. This difficulty most probably presented a serious obstacle to contemporary attempts to understand Brouwer’s contributio…

Law of ContinuityTransfinite inductionObstacleGeneral problemSet theoryChoice sequenceEpistemology
researchProduct

A new definition of well-behaved discrimination functions

2009

Abstract A discrimination function shows the probability or degree with which stimuli are discriminated from each other when presented in pairs. In a previous publication [Kujala, J.V., & Dzhafarov, E.N. (2008). On minima of discrimination functions. Journal of Mathematical Psychology , 52 , 116–127] we introduced a condition under which the conformity of a discrimination function with the law of Regular Minimality (which says, essentially, that “being least discriminable from” is a symmetric relation) implies the constancy of the function’s minima (i.e., the same level of discriminability of every stimulus from the stimulus least discriminable from it). This condition, referred to as “well…

Mathematical psychologyApplied Mathematicsmedia_common.quotation_subjectHausdorff spaceTransitive closureStimulus (physiology)ConformityCombinatoricsMaxima and minimaSymmetric relationTransfinite inductionGeneral Psychologymedia_commonMathematicsJournal of Mathematical Psychology
researchProduct